Reachable Nearest Neighbour Query Processing of R-Trees for Moving Query Object
نویسندگان
چکیده
منابع مشابه
Efficient mutual nearest neighbor query processing for moving object trajectories
Given a set D of trajectories, a query object q, and a query time extent C, amutual (i.e., symmetric) nearest neighbor (MNN) query over trajectories finds from D, the set of trajectories that are among the k1 nearest neighbors (NNs) of q within C, and meanwhile, have q as one of their k2 NNs. This type of queries is useful inmany applications such as decisionmaking, data mining, and pattern rec...
متن کاملFast Nearest-Neighbor Query Processing in Moving-Object Databases
A desirable feature in spatio-temporal databases is the ability to answer future queries, based on the current data characteristics (reference position and velocity vector). Given a moving query and a set of moving objects, a future query asks for the set of objects that satisfy the query in a given time interval. The difficulty in such a case is that both the query and the data objects change ...
متن کاملAn Efficient Data Dissemination Scheme for Nearest Neighbour Query Processing
Location dependent information services (LDISs) produce answers to queries according to the location of the client issuing the query. In LDIS, techniques such as caching, prefetching and broadcasting are effective approaches to reducing the wireless bandwidth requirement and query response time. However, the client’s mobility may lead to inconsistency problems. In this paper, we introduce the b...
متن کاملQuery Processing and Optimization for Pictorial Query Trees
Methods for processing of pictorial queries speci ed by pictorial query trees are presented. Leaves of a pictorial query tree correspond to individual pictorial queries while internal nodes correspond to logical operations on them. Algorithms for processing individual pictorial queries and for parsing and computing the overall result of a pictorial query tree are presented. Issues involved in o...
متن کاملGPU-based Spatial Indexing and Query Processing Using R-Trees
R-trees are popular spatial indexing techniques that have been widely used in many geospatial applications. The increasingly available Graphics Processing Units (GPUs) for general computing have attracted considerable research interests in applying the massive data parallel technologies to index and query geospatial data based on R-trees. In this paper, we investigate on the potential of accele...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Computer Applications
سال: 2012
ISSN: 0975-8887
DOI: 10.5120/7716-0954